Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
نویسندگان
چکیده
We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in an undirected planar EVC-network to the minimum edge-cut problem in another planar network with edge capacity only (EC-network), thus the minimum-cut or the maximum flow value can be computed in O(n log n) time. Based on this reduction, in this paper we devise an O(n log n) time algorithm for computing the maximum flow in an undirected general planar EVCnetwork and an O(n) time algorithm for computing the maximum flow in an undirected (s, t)-planar EVC-network. As a result, the maximum flow problem in undirected planar EVC-networks is as easy as the problem in undirected planar EC-networks in terms of computational complexity.
منابع مشابه
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs
In this paper we study the maximum two-flow problem in vertexand edge-capacitated undirected STI-planar graphs, that is, planar graphs where the vertices of each terminal pair arc on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the valu...
متن کاملImproved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کاملA Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کاملFast Augmenting Paths by Random Sampling from Residual Graphs
Consider an n-vertex, m-edge, undirected graph with integral capacities and maxflow value v. We give a new Õ(m + nv)-time maximum flow algorithm. After assigning certain special sampling probabilities to edges in Õ(m) time, our algorithm is very simple: repeatedly find an augmenting path in a random sample of edges from the residual graph. Breaking from past work, we demonstrate that we can ben...
متن کاملBalanced Network Flows
Let G be a simple, undirected graph. A special network N, called a balanced network, is constructed from G such that maximum matchings and f-factors in G correspond to maximum flows in N. A max-balancedflow-min-balanced-cut theorem is proved for balanced networks. It is shown that Tutte’s Factor Theorem is equivalent to this network flow theorem, and that f-barriers are equivalent to minimum ba...
متن کامل